Incremental unsupervised feature selection for dynamic incomplete multi-view data

نویسندگان

چکیده

Multi-view unsupervised feature selection has been proven to be efficient in reducing the dimensionality of multi-view unlabeled data with high dimensions. The previous methods assume that all views are complete. However, real applications, often incomplete, i.e., some instances missing, which will result failure these methods. Besides, while arrive form streams, existing suffer issues storage cost and expensive computation time. To address issues, we propose an Incremental Incomplete Unsupervised Feature Selection method (I2MUFS) on incomplete streaming data. By jointly considering consistent complementary information across different views, I2MUFS embeds into extended weighted non-negative matrix factorization model, can learn a consensus clustering indicator fuse latent matrices adaptive view weights. Furthermore, introduce incremental learning mechanisms develop alternative iterative algorithm, where is incrementally updated, rather than recomputing entire updated from scratch. A series experiments conducted verify effectiveness proposed by comparing several state-of-the-art experimental results demonstrate efficiency terms metrics computational cost.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unsupervised Feature Selection for Multi-View Data in Social Media

The explosive popularity of social media produces mountains of high-dimensional data and the nature of social media also determines that its data is often unlabelled, noisy and partial, presenting new challenges to feature selection. Social media data can be represented by heterogeneous feature spaces in the form of multiple views. In general, multiple views can be complementary and, when used ...

متن کامل

Unsupervised Distributed Feature Selection for Multi-view Object Recognition

Object recognition accuracy can be improved when information from multiple views is integrated, but information in each view can often be highly redundant. We consider the problem of distributed object recognition or indexing from multiple cameras, where the computational power available at each camera sensor is limited and communication between sensors is prohibitively expensive. In this scena...

متن کامل

Adaptive Unsupervised Multi-view Feature Selection for Visual Concept Recognition

To reveal and leverage the correlated and complemental information between different views, a great amount of multi-view learning algorithms have been proposed in recent years. However, unsupervised feature selection in multiview learning is still a challenge due to lack of data labels that could be utilized to select the discriminative features. Moreover, most of the traditional feature select...

متن کامل

Unsupervised Multi-View Feature Selection via Co-Regularization

Existing unsupervised feature selection algorithms are designed to extract the most relevant subset of features that can facilitate clustering and interpretation of the obtained results. However, these techniques are not applicable in many real-world scenarios where one has an access to datasets consisting of multiple views/representations e.g. various omics profiles of the patients, medical te...

متن کامل

Unsupervised Feature Selection for Text Data

Feature selection for unsupervised tasks is particularly challenging, especially when dealing with text data. The increase in online documents and email communication creates a need for tools that can operate without the supervision of the user. In this paper we look at novel feature selection techniques that address this need. A distributional similarity measure from information theory is appl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Fusion

سال: 2023

ISSN: ['1566-2535', '1872-6305']

DOI: https://doi.org/10.1016/j.inffus.2023.03.018